One Approach for Parallel Algorithms Representation
نویسندگان
چکیده
منابع مشابه
Parallel Algorithms for Zero-One Supply-Demand Problems
A technique which yields fast parallel algorithms for several z ero-one supplydemand problems is presented. We give NC algorithms for the following related problems: (1) Given a sequence of supplies a 11 .•. ,an and demands b1 , ... ,bm, construct a zero-one flow pattern satisfyiag these constraints, whe re every supply vertex can send at most one unit of flow to each demand vertex. (2) Given a...
متن کاملA representation for some groups, a geometric approach
In the present paper, we are going to use geometric and topological concepts, entities and properties of the integral curves of linear vector fields, and the theory of differential equations, to establish a representation for some groups on $R^{n} (ngeq 1)$. Among other things, we investigate the surjectivity and faithfulness of the representation. At the end, we give some app...
متن کاملAlgorithms for the Sandbag: an Approach to Imprecise Set Representation
The sandbag expressively models uncertainty, impre-cision, and varying quality of information about a set. This paper describes an approach to constructing sandbags incrementally from a set of constraints called a fact set. The complexities of fundamental sandbag operations using the fact set approach depend on the application, but are generally intractable. However, by sacriicing optimality, r...
متن کاملThe Development of Parallel Resolution Algorithms Using the Graph Representation
The parallel resolution procedures based on graph structures method are presented. OR-, ANDand DCDPparallel inference on connection graph representation is explored and modifications to these algorithms using heuristic estimation are proposed. The principles for designing these heuristic functions are thoroughly discussed. The colored clause graphs resolution principle is presented. The compari...
متن کاملA Higher-Order Approach to Parallel Algorithms
A unified approach to the development of algorithms tailored to various classes of parallel computer architecture is presented. The central theme is to identify a small set of higher-order functions that can be implemented efficiently on the target architecture and which can be used to express parallel algorithms in general via mechanised program transformation from some higher-level specificat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Balkan Journal of Electrical and Computer Engineering
سال: 2017
ISSN: 2147-284X
DOI: 10.17694/bajece.334294